Relative Privacy Threats and Learning From Anonymized Data
نویسندگان
چکیده
منابع مشابه
Privacy vs. Utility in Anonymized Data
We investigate the privacy and utility aspects of k-anonymity, which has received much research attention since its introduction in [Sweeney, 2002]. Meyerson and Williams [2004] showed that finding an optimal k-anonymization is NP-hard and developed a first approximation algorithm. Further algorithms with different approximation guarantees have been proposed, but it remains hard to compare thes...
متن کاملAnonymized Local Privacy
In 2003 Dinur and Nissim showed an impossibility result for privacy that if the amount of noise is o( √ n), then privacy is impossible to achieve (where the output space is binary “Yes” or “No”). Ω( √ n) noise must be added to have at least weak notions of privacy. However, the question has remained open as to whether O(n) noise is able to preserve accuracy in elementary private data operations...
متن کاملOn Web Browsing Privacy in Anonymized NetFlows
Anonymization of network traces is widely viewed as a necessary condition for releasing such data for research purposes. For obvious privacy reasons, an important goal of trace anonymization is to suppress the recovery of web browsing activities. While several studies have examined the possibility of reconstructing web browsing activities from anonymized packet-level traces, we argue that these...
متن کاملPrivacy Risk in Anonymized Heterogeneous Information Networks
Anonymized user datasets are often released for research or industry applications. As an example, t.qq.com released its anonymized users’ profile, social interaction, and recommendation log data in KDD Cup 2012 to call for recommendation algorithms. Since the entities (users and so on) and edges (links among entities) are of multiple types, the released social network is a heterogeneous informa...
متن کاملPrivacy Problems with Anonymized Transaction Databases
In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In particular, we show how an anonymized transaction database can be deanonymized using non-anonymized frequent itemsets. We describe how the problem can be formulated as an integer programming task, study the computati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Forensics and Security
سال: 2020
ISSN: 1556-6013,1556-6021
DOI: 10.1109/tifs.2019.2937640